Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

Q is empty.


QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

The set Q consists of the following terms:

app(app(mapt, x0), app(leaf, x1))
app(app(mapt, x0), app(node, x1))
app(app(maptlist, x0), nil)
app(app(maptlist, x0), app(app(cons, x1), x2))


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(maptlist, f), xs)
APP(app(mapt, f), app(leaf, x)) → APP(f, x)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(cons, app(app(mapt, f), x))
APP(app(mapt, f), app(node, xs)) → APP(node, app(app(maptlist, f), xs))
APP(app(mapt, f), app(node, xs)) → APP(maptlist, f)
APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(mapt, f)
APP(app(mapt, f), app(leaf, x)) → APP(leaf, app(f, x))
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(mapt, f), x)

The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

The set Q consists of the following terms:

app(app(mapt, x0), app(leaf, x1))
app(app(mapt, x0), app(node, x1))
app(app(maptlist, x0), nil)
app(app(maptlist, x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(maptlist, f), xs)
APP(app(mapt, f), app(leaf, x)) → APP(f, x)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(cons, app(app(mapt, f), x))
APP(app(mapt, f), app(node, xs)) → APP(node, app(app(maptlist, f), xs))
APP(app(mapt, f), app(node, xs)) → APP(maptlist, f)
APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(mapt, f)
APP(app(mapt, f), app(leaf, x)) → APP(leaf, app(f, x))
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(mapt, f), x)

The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

The set Q consists of the following terms:

app(app(mapt, x0), app(leaf, x1))
app(app(mapt, x0), app(node, x1))
app(app(maptlist, x0), nil)
app(app(maptlist, x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(mapt, f), app(leaf, x)) → APP(f, x)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(cons, app(app(mapt, f), x))
APP(app(mapt, f), app(node, xs)) → APP(node, app(app(maptlist, f), xs))
APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)
APP(app(mapt, f), app(node, xs)) → APP(maptlist, f)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(mapt, f)
APP(app(mapt, f), app(leaf, x)) → APP(leaf, app(f, x))
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(mapt, f), x)

The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

The set Q consists of the following terms:

app(app(mapt, x0), app(leaf, x1))
app(app(mapt, x0), app(node, x1))
app(app(maptlist, x0), nil)
app(app(maptlist, x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 6 less nodes.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
QDP
                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(maptlist, f), xs)
APP(app(mapt, f), app(leaf, x)) → APP(f, x)
APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(mapt, f), x)

The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

The set Q consists of the following terms:

app(app(mapt, x0), app(leaf, x1))
app(app(mapt, x0), app(node, x1))
app(app(maptlist, x0), nil)
app(app(maptlist, x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP(app(mapt, f), app(leaf, x)) → APP(f, x)
The remaining pairs can at least be oriented weakly.

APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(maptlist, f), xs)
APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(mapt, f), x)
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  APP(x1)
app(x1, x2)  =  app(x2)
maptlist  =  maptlist
cons  =  cons
mapt  =  mapt
leaf  =  leaf
node  =  node

Recursive Path Order [2].
Precedence:
[maptlist, mapt] > [APP1, app1, cons]
leaf > [APP1, app1, cons]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof
QDP
                      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(maptlist, f), xs)
APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(mapt, f), x)

The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

The set Q consists of the following terms:

app(app(mapt, x0), app(leaf, x1))
app(app(mapt, x0), app(node, x1))
app(app(maptlist, x0), nil)
app(app(maptlist, x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

MAPTLIST(f, cons(x, xs)) → MAPT(f, x)
MAPTLIST(f, cons(x, xs)) → MAPTLIST(f, xs)
MAPT(f, node(xs)) → MAPTLIST(f, xs)

R is empty.
The set Q consists of the following terms:

mapt(x0, leaf(x1))
mapt(x0, node(x1))
maptlist(x0, nil)
maptlist(x0, cons(x1, x2))

We have to consider all minimal (P,Q,R)-chains.


The following pairs can be oriented strictly and are deleted.


APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) → APP(app(mapt, f), x)
The remaining pairs can at least be oriented weakly.

APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)
Used ordering: Combined order from the following AFS and order.
MAPTLIST(x1, x2)  =  MAPTLIST(x2)
cons(x1, x2)  =  cons(x1, x2)
MAPT(x1, x2)  =  MAPT(x2)
node(x1)  =  x1

Recursive Path Order [2].
Precedence:
[MAPTLIST1, cons2, MAPT1]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof
                    ↳ QDP
                      ↳ QDPOrderProof
QDP
                          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(mapt, f), app(node, xs)) → APP(app(maptlist, f), xs)

The TRS R consists of the following rules:

app(app(mapt, f), app(leaf, x)) → app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) → app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) → nil
app(app(maptlist, f), app(app(cons, x), xs)) → app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

The set Q consists of the following terms:

app(app(mapt, x0), app(leaf, x1))
app(app(mapt, x0), app(node, x1))
app(app(maptlist, x0), nil)
app(app(maptlist, x0), app(app(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.